List-colouring Squares of Sparse Subcubic Graphs
نویسندگان
چکیده
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs. We show that the choosability χ (G2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ (G2) is at most five if d < 7/3 and it is at most six if d < 5/2. Wegner’s conjecture claims that the chromatic number of the square of a subcubic planar graph is at most seven. Let G be a planar subcubic graph of girth g. Our result implies that χ (G2) is at most four if g ≥ 24, it is at most 5 if g ≥ 14, and it is at most 6 if g ≥ 10. For lower bounds, we find a planar subcubic graph G1 of girth 9 such that χ(G1) = 5 and a planar subcubic graph G2 of girth five such that χ(G2) = 6. As a consequence, we show that the problem of 4-colouring of the square of a subcubic planar graph of girth g = 9 is NP-complete. We conclude the paper by posing few conjectures.
منابع مشابه
List-Coloring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs and show that the choosability χ`(G 2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ`(G 2) is at most five if d < 7/3 ...
متن کاملChoosability of the square of planar subcubic graphs with large girth
We first show that the choose number of the square of a subcubic graph with maximum average degree less than 18/7 is at most 6. As a corollary, we get that the choose number of the square of a planar graph with girth at least 9 is at most 6. We then show that the choose number of the square of a subcubic planar graph with girth at least 13 is at most 5. Key-words: colouring, list colouring, pla...
متن کاملOn strong edge-colouring of subcubic graphs
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of length 3 uses three different colours. In this paper we improve some previous results on the strong edgecolouring of subcubic graphs by showing that every subcubic graph with maximum average degree strictly less than 73 (resp. 5 2 , 8 3 , 20 7 ) can be strongly edge-coloured with six (resp. seven, eight, nin...
متن کاملStrong edge-colouring and induced matchings
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three colours. An induced matching of a graph G is a subset I of edges of G such that the graph induced by the endpoints of I is a matching. In this paper, we prove the NP-completeness of strong 4, 5, and 6-edge-colouring and maximum induced matching in some subclasses of subcubic triangle-f...
متن کامل